Generalized comparison of graph-based ranking algorithms for publications and authors
نویسندگان
چکیده
Citation analysis helps in evaluating the impact of scientific collections (journals and conferences), publications and scholar authors. In this paper we examine known algorithms that are currently used for Link Analysis Ranking, and present their weaknesses over specific examples. We also introduce new alternative methods specifically designed for citation graphs. We use the SCEAS system as a base platform to introduce these new methods and perform a generalized comparison of all methods. We also introduce an aggregate function for the generation of author ranking based on publication ranking. Finally, we try to evaluate the rank results based on the prizes of ‘VLDB 10 Year Award’, ‘SIGMOD Test of Time Award’ and ’SIGMOD E.F.Codd Innovations Award‘.
منابع مشابه
A New Hybrid Method for Web Pages Ranking in Search Engines
There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...
متن کاملUnified author ranking based on integrated publication and venue rank
Authors’ ranking can be used to determine authenticity of authors in particular domain. Several different methods for author ranking focusing on number of publications and number of citations are proposed. In this paper, we propose ranking algorithms for publications, conferences, journals and respective authors. In publication ranking, both incoming and outgoing citations are considered. In ca...
متن کاملDesign of cybernetic metamodel of cryptographic algorithms and ranking of its supporting components using ELECTRE III method
Nowadays, achieving desirable and stable security in networks with national and organizational scope and even in sensitive information systems, should be based on a systematic and comprehensive method and should be done step by step. Cryptography is the most important mechanism for securing information. a cryptographic system consists of three main components: cryptographic algorithms, cryptogr...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کامل$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Systems and Software
دوره 79 شماره
صفحات -
تاریخ انتشار 2006